Lecture 5: The sliding window protocol

نویسنده

  • Anirudh Sivaraman
چکیده

network utilization (the ratio of throughput to the capacity of the underlying network) is PKT SIZE RTT / C, where C is the network’s capacity, PKT SIZE is the size of a single packet, and RTT is the round-trip time for the path from the sender to the receiver. When we use the variable RTT , we mean the minimum round-trip time excluding queueing delays inflicted by transmissions between the sender and receiver and excluding any packet transmission delays. Let’s plug in some rough numbers for these three parameters to understand how bad the network utilization can be. PKT SIZE is 1448 bytes on the Ethernet link from my office desktop. Let’s pick an RTT of 80 ms to reflect a coast-to-coast US path. The value of C for the path between NYC and a server in SFO is about 370 Mbit/s on my wired network when measured by speedtest.net, The network utilization with these numbers is about 0.04%, which is terrible. In general, the network utilization for the Stop-And-Wait protocol is the least on networks with large RTTs and large link capacity, i.e., long and fat networks (LFN, often pronounced elephen). Clearly, we would like to do better. In today’s lecture, we’ll discuss a protocol called the sliding window protocol with significantly better throughput.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and Performance Analysis of a Sliding Window Protocol

The sliding window algorithm is widely used in many standard network protocols. It can ensure a correct data transfer over unreliable channels where packets may be duplicated, lost, or re-ordered. By now only few papers have presented the performance of the sliding window protocol. A number of parameters affecting the overall performance of the system still need to be investigated systematicall...

متن کامل

Formal Model and Analysis of Sliding Window Protocol Based on NuSMV

System states space based on Kripke structure can be exhausted by model checking, thus system key property described by temporal logic can be automatically verified. Presently model checking has been widely used in hardware validation and network protocol analysis. Sliding window protocol is a classical receive-send protocol, which is used in TCP/IP protocol group. In this paper, we propose the...

متن کامل

Verifying a Sliding Window Protocol in µCRL

We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. We show that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and was checked with the help of PVS.

متن کامل

The SDL Speci cation of the Sliding Window Protocol Revisited

This paper is a corrigendum to the SDL speci cation of the sliding window protocol which was rst published by the ISO IEC as a technical report We present some results of a tool supported simulation of the SDL speci cation of the sliding window protocol We found out that the speci cation contains signi cant errors and does not meet the informal description of the protocol In this paper we descr...

متن کامل

Verification of a sliding window protocol in μCRL

We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and has been checked in the theorem prover PVS. Keywords— μCRL, branching bisimulation, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017